Fractional Perfect b-Matching Polytopes. I: General Theory
نویسنده
چکیده
Abstract. The fractional perfect b-matching polytope of an undirected graph G is the polytope of all assignments of nonnegative real numbers to the edges of G such that the sum of the numbers over all edges incident to any vertex v is a prescribed nonnegative number bv. General theorems which provide conditions for nonemptiness, give a formula for the dimension, and characterize the vertices, edges and face lattices of such polytopes are obtained. Many of these results are expressed in terms of certain spanning subgraphs of G which are associated with subsets or elements of the polytope. For example, it is shown that an element u of the fractional perfect b-matching polytope of G is a vertex of the polytope if and only if each component of the graph of u either is acyclic or else contains exactly one cycle with that cycle having odd length, where the graph of u is defined to be the spanning subgraph of G whose edges are those at which u is positive.
منابع مشابه
Gorenstein Polytopes Obtained from Bipartite Graphs
Beck et. al. characterized the grid graphs whose perfect matching polytopes are Gorenstein and they also showed that for some parameters, perfect matching polytopes of torus graphs are Gorenstein. In this paper, we complement their result, that is, we characterize the torus graphs whose perfect matching polytopes are Gorenstein. Beck et. al. also gave a method to construct an infinite family of...
متن کاملA TDI Description of Restricted 2-Matching Polytopes
We give a TDI description for a class of polytopes which corresponds to a restricted 2-matching problem. The perfect matching polytope, triangle-free perfect 2-matching polytope and relaxations of the traveling salesman polytope are members of this class. For a class of restrictions G. Cornuéjols, D. Hartvigsen and W.R. Pulleyblank have shown that the unweighted problem is tractable; here we sh...
متن کاملOn Matroid Parity and Matching Polytopes∗
The matroid parity (MP) problem is a natural extension of the matching problem to the matroid setting. It can be formulated as a 0− 1 linear program using the so-called rank and line constraints. We call the associated family of polytopes MP polytopes. We then prove the following: (i) when the matroid is a gammoid, each MP polytope is a projection of a perfect matching polytope into a suitable ...
متن کاملGrid Graphs, Gorenstein Polytopes, and Domino Stackings
We examine domino tilings of rectangular boards, which are in natural bijection with perfect matchings of grid graphs. This leads to the study of their associated perfect matching polytopes, and we present some of their properties, in particular, when these polytopes are Gorenstein. We also introduce the notion of domino stackings and present some results and several open questions. Our techniq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1301.7356 شماره
صفحات -
تاریخ انتشار 2013